Sidon sets and graphs without 4-cycles
نویسندگان
چکیده
منابع مشابه
Extremal graphs without 4-cycles
We prove an upper bound for the number of edges a C4-free graph on q 2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q. Let n be a positive integer and G a graph. We define ex(n,G) to be the largest number of edges possible in a graph on n vertices that does not contain G as a subgraph; we call a graph o...
متن کاملSidon Sets in Groups and Induced Subgraphs of Cayley Graphs
Let S be a subset of a group G. We call S a Sidon subset of the first (second) kind, if for any x, y, Z, WE S of which at least 3 are different, xy ~ ZW (xy I "" zwI , resp.). (For abelian groups, the two notions coincide.) If a has a Sidon subset of the second kind with n elements then every n-vertex graph is an induced subgraph of some Cayley graph of G. We prove that a sufficient condition f...
متن کامل4-critical Graphs on Surfaces without Contractible (<=4)-cycles
We show that if G is a 4-critical graph embedded in a fixed surface Σ so that every contractible cycle has length at least 5, then G can be expressed as G = G′ ∪ G1 ∪ G2 ∪ . . . ∪ Gk, where |V (G′)| and k are bounded by a constant (depending linearly on the genus of Σ) and G1, . . . , Gk are graphs (of unbounded size) whose structure we describe exactly. The proof is computer-assisted—we use co...
متن کاملWell-dominated graphs without cycles of lengths 4 and 5
Let G be a graph. A set S of vertices in G dominates the graph if every vertex of G is either in S or a neighbor of a vertex in S. Finding a minimal cardinality set which dominates the graph is an NP-complete problem. The graph G is well-dominated if all its minimal dominating sets are of the same cardinality. The complexity status of recognizing well-dominated graphs is not known. We show that...
متن کاملGeneralized Sidon sets
We give asymptotic sharp estimates for the cardinality of a set of residue classes with the property that the representation function is bounded by a prescribed number. We then use this to obtain an analogous result for sets of integers, answering an old question of Simon Sidon. © 2010 Elsevier Inc. All rights reserved. MSC: 11B
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2014
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2014.v5.n2.a1